Random Walks and Percolation on Trees

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Random walks on supercritical percolation clusters

We obtain Gaussian upper and lower bounds on the transition density qt(x, y) of the continuous time simple random walk on a supercritical percolation cluster C∞ in the Euclidean lattice. The bounds, analogous to Aronsen’s bounds for uniformly elliptic divergence form diffusions, hold with constants ci depending only on p (the percolation probability) and d. The irregular nature of the medium me...

متن کامل

Random walks on complex trees.

We study the properties of random walks on complex trees. We observe that the absence of loops is reflected in physical observables showing large differences with respect to their looped counterparts. First, both the vertex discovery rate and the mean topological displacement from the origin present a considerable slowing down in the tree case. Second, the mean first passage time (MFPT) display...

متن کامل

Random Walks on Rooted Trees

For arbitrary positive integers h and m, we consider the family of all rooted trees of height h having exactly m vertices at distance h from the root. We refer to such trees as (h,m)-trees. For a tree T from this family, we consider a simple random walk on T which starts at the root and terminates when it visits one of the m vertices at distance h from the root. Consider the problem of finding ...

متن کامل

Random Walks and Trees

These notes provide an elementary and self-contained introduction to branching random walks. Section 1 gives a brief overview of Galton–Watson trees, whereas Section 2 presents the classical law of large numbers for branching random walks. These two short sections are not exactly indispensable, but they introduce the idea of using size-biased trees, thus giving motivations and an avant-goût to ...

متن کامل

On the Speed of Random Walks on a Percolation Cluster of Trees

We consider the simple random walk on the infinite cluster of the Bernoulli bond percolation of trees, and investigate the relation between the speed of the simple random walk and the retaining probability by studying three classes of trees. A sufficient condition is established for Galton-Watson trees.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Probability

سال: 1990

ISSN: 0091-1798

DOI: 10.1214/aop/1176990730